Efficient Query Processing with Compiled Knowledge Bases
نویسندگان
چکیده
The goal of knowledge compilation is to enable fast queries. Prior approaches had the goal of small (i.e., polynomial in the size of the initial knowledge bases) compiled knowledge bases. Typically, query-response time is linear, so that the efficiency of querying the compiled knowledge base depends on its size. In this paper, a target for knowledge compilation called the ri-trie is introduced; it has the property that even if they are large they nevertheless admit fast queries. Specifically, a query can be processed in time linear in the size of the query regardless of the size of the compiled knowledge base.
منابع مشابه
Reduced Implicant Tries
The goal of knowledge compilation is to enable fast queries. Such queries are often in the form of conjunctive normal form (CNF) clauses, and the query amounts to the question of whether the clause is implied by the knowledge base. Here, we consider the dual type of query which is a DNF clause; the query then amounts to the question of whether the knowledge base is implied by the clause. Prior ...
متن کاملQueripidia: Query-specific Wikipedia Construction
With Queripidia we want to answer questions on the fringe of Wikipedia. Given a large, general-purpose knowledge base and a large corpus of web documents, the goal is to consolidate information from both sources to jointly extract material to answer the given query with an automatically compiled query-specific Wikipedia.
متن کاملEpistemic First-order Queries over Description Logic Knowledge Bases
Querying Description Logic knowledge bases has received great attention in the last years. The need of coping with incomplete information is the distinguishing feature with respect to querying databases. Due to this feature, we have to deal with two conflicting needs: on the one hand, we would like to query the knowledge base with sophisticated mechanisms provided by full first-order logic as i...
متن کاملArchimedesOne: Query Processing over Probabilistic Knowledge Bases
Knowledge bases are becoming increasingly important in structuring and representing information from the web. Meanwhile, webscale information poses significant scalability and quality challenges to knowledge base systems. To address these challenges, we develop a probabilistic knowledge base system, ARCHIMEDESONE, by scaling up the knowledge expansion and statistical inference algorithms. We de...
متن کاملEffective searching of RDF knowledge bases
RDF data has become a vital source of information for many applications. In this thesis, we present a set of models and algorithms to effectively search large RDF knowledge bases. These knowledge bases contain a large set of subjectpredicate-object (SPO) triples where subjects and objects are entities and predicates express relationships between them. Searching such knowledge bases can be done ...
متن کامل